Solutions to the generalized Towers of Hanoi problem
نویسنده
چکیده
The purpose of this paper is to prove the Frame-Stewart algorithm for the generalized Towers of Hanoi problem as well as finding the number of moves required to solve the problem and studying the multitude of optimal solutions. The main idea is to study how to most effectively move away all but the last disc and use the fact that the total number of moves required to solve the problem is twice this number plus one.
منابع مشابه
Twin Towers of Hanoi
In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs (the smallest disk from one of the pegs is moved to the other peg), but also, simultaneously, between the corresponding pair of pegs in the cou...
متن کاملSystem of fuzzy fractional differential equations in generalized metric space
In this paper, we study the existence of integral solutions of fuzzy fractional differential systems with nonlocal conditions under Caputo generalized Hukuhara derivatives. These models are considered in the framework of completegeneralized metric spaces in the sense of Perov. The novel feature of our approach is the combination of the convergentmatrix technique with Schauder fixed point princi...
متن کاملHamiltonianicity of the Towers of Hanoi Problem
In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting configuration. Also, we show how the origi...
متن کاملOptimisation in a natural system: Argentine ants solve the Towers of Hanoi.
Natural systems are a source of inspiration for computer algorithms designed to solve optimisation problems. Yet most 'nature-inspired' algorithms take only superficial inspiration from biology, and little is known about how real biological systems solve difficult problems. Moreover, ant algorithms, neural networks and similar methods are usually applied to static problems, whereas most biologi...
متن کاملOn the Solution of the Towers of Hanoi Problem
In this paper, two versions of an iterative loopless algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2) time complexity are presented. Based on this algorithm the number of different moves in each of pegs with its direction is formulated. Keywords—Loopless algorithm, Binary tree, Towers of Hanoi.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.4411 شماره
صفحات -
تاریخ انتشار 2012